Semi-Iterative Method for Computing the Generalized InverseAT,S(2)
نویسندگان
چکیده
منابع مشابه
A Novel Iterative Method for Computing Generalized Inverse
In this letter, we propose a novel iterative method for computing generalized inverse, based on a novel KKT formulation. The proposed iterative algorithm requires making four matrix and vector multiplications at each iteration and thus has low computational complexity. The proposed method is proved to be globally convergent without any condition. Furthermore, for fast computing generalized inve...
متن کاملIterative methods for computing generalized inverses
In this article we extend the method of Yong-Lin Chen (Iterative methods for computing the generalized inverses A (2) T,S of a matrix A, Appl. Math. Comput. 75 (2-3) (1996)) to inifinite dimensional settings. Precisely, we construct an iterative method for computing outer generalized inverses of operators on Banach spaces, and also for computing the generalized Drazin inverse of Banach algebra ...
متن کاملUniversal Iterative Methods for Computing Generalized Inverses
In this paper we construct a few iterative processes for computing {1, 2} inverses of a linear bounded operator, based on the hyper-power iterative method or the Neumann-type expansion. Under the suitable conditions these methods converge to the {1, 2, 3} or {1, 2, 4} inverses. Also, we specify conditions when the iterative processes converge to the Moore-Penrose inverse, the weighted Moore-Pen...
متن کاملComputing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method
A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...
متن کاملComplete Iterative Method for Computing Pseudospectra
EEcient codes for computing pseudospectra of large sparse matrices usually use a Lanczos type method with the shift and invert technique and a shift equal to zero. Then, these codes are very eecient for computing pseudospectra on regions where the matrix is nonnormal (because k(A ? zI) ?1 k2 is large) but they lose their eeciency when they compute pseudospectra on regions where the spectrum of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Abstract and Applied Analysis
سال: 2015
ISSN: 1085-3375,1687-0409
DOI: 10.1155/2015/849487